Convergence of Gibbs Measures Associated with Simulated Annealing

نویسندگان

  • Dennis D. Cox
  • Robert M. Hardt
  • Petr Kloucek
چکیده

We start with an explanation of Simulated Annealing. In order to do this, we quote the paper “Convergence of Gibbs Measures Associated with Simulated Annealing” [CHK], by professors Dennis Cox of the Rice University Statistics department, Robert Hardt of the Rice University Mathematics department, and Petr Klouček of the University of Houston Texas Learning and Computation Center, which states that “Simulated annealing is a stochastic optimization algorithm that mimics the physical process of a thermodynamic system settling into a state of minimal energy while lowering the ‘temperature.’” When a system is at a high temperature, the particles in the system are more spread out, and have a high amount of energy. In contrast, when the system is near absolute zero, the particles concentrate on the system and move very slowly. Annealing explains this process. Simulated annealing is given by a Gibbs measure, which we now describe:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gibbs Sampler-based Path Planning for Autonomous Vehicles: Convergence Analysis

Simulation has indicated that distributed self-organization of autonomous swarms might be achieved through Gibbs sampler-based simulated annealing. However, the dynamic nature of the underlying graph presents significant challenges in convergence analysis. As a first step toward such analysis, convergence of the algorithm is established in this paper for two special cases: single vehicle with l...

متن کامل

A stochastic algorithm finding p-means on the circle

A stochastic algorithm is proposed, finding the set of intrinsic p-mean(s) associated to a probability measure ν on a compact Riemannian manifold and to p P r1,8q. It is fed sequentially with independent random variables pYnqnPN distributed according to ν and this is the only knowledge of ν required. Furthermore the algorithm is easy to implement, because it evolves like a Brownian motion betwe...

متن کامل

Simulated annealing, acceleration techniques, and image restoration

Typically, the linear image restoration problem is an ill-conditioned, underdetermined inverse problem. Here, stabilization is achieved via the introduction of a first-order smoothness constraint which allows the preservation of edges and leads to the minimization of a nonconvex functional. In order to carry through this optimization task, we use stochastic relaxation with annealing. We prefer ...

متن کامل

Markov Chain Monte Carlo and Related Topics

This article provides a brief review of recent developments in Markov chain Monte Carlo methodology. The methods discussed include the standard Metropolis-Hastings algorithm, the Gibbs sampler, and various special cases of interest to practitioners. It also devotes a section on strategies for improving mixing rate of MCMC samplers, e.g., simulated tempering, parallel tempering, parameter expans...

متن کامل

A quantum diffusion network

Wong’s diffusion network is a stochastic, zero-input Hopfield network [8] with a Gibbs stationary distribution over a bounded, connected continuum [13]. Previously, logarithmic thermal annealing was demonstrated for the diffusion network [10], [7] and digital versions of it were studied and applied to imaging [14]. Recently, “quantum” annealed Markov chains have garnered significant attention [...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Math. Analysis

دوره 39  شماره 

صفحات  -

تاریخ انتشار 2008